On an efficient k-step iterative method for nonlinear equations
نویسندگان
چکیده
منابع مشابه
A note on three-step iterative method for nonlinear equations
In this short note we give certain comments and improvements of some three-step iterative methods recently considered by N.A. Mir and T. Zaman (Appl. Math. Comput. (2007) doi: 10.1016/j.amc.2007.03.071).
متن کاملAn Efficient Two-step Iterative Method for Solving System of Nonlinear Equations
In this paper, we propose and analyze a new predictor-corrector method for solving a nonlinear system of equations using the weight combination of mid-point, Trapezoidal and quadrature formulas. A new algorithm based on this method has been presented. The proposed method has been tested on a series of examples published in the literature and shows good results. Comparison with other similar met...
متن کاملAn efficient three-step iterative method with sixth-order convergence for solving nonlinear equations
The aim of this paper is to construct an e¢ cient iterative method to solve nonlinear equations. This method is obtained from M. Javidis method (Appl. Math. Comput. 193 (2007) 360-365), which is third-order. The convergence order of new method is established to six and the e¢ ciency index is 1.5651. The Proposed method is compared with the second, third and sixth order methods. Some numerical ...
متن کاملThree-Step Iterative Method for Solving Nonlinear Equations
In this paper, a published algorithm is investigated that proposes a three-step iterative method for solving nonlinear equations. This method is considered to be efficient with third order of convergence and an improvement to previous methods. This paper proves that the order of convergence of the previous scheme is two, and the efficiency index is less than the corresponding Newton’s method. I...
متن کاملAN ITERATIVE METHOD WITH SIX-ORDER CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS
Modification of Newtons method with higher-order convergence is presented. The modification of Newtons method is based on Frontinis three-order method. The new method requires two-step per iteration. Analysis of convergence demonstrates that the order of convergence is 6. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newtons method and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2016
ISSN: 0377-0427
DOI: 10.1016/j.cam.2016.02.003